Semisymmetric polynomials and the invariant theory of matrix vector pairs
نویسندگان
چکیده
In this paper we investigate a new family of multivariable polynomials. These polynomials, denoted Rλ(z1, . . . , zn; r), depend on a parameter r and are indexed by a partition λ of length n. Up to a scalar, Rλ is characterized by the following elementary properties: • Rλ is symmetric in the odd variables z1, z3, z5, . . . as well as in the even variables z2, z4, z6, . . .. Polynomials having this kind of symmetry are called semisymmetric. • For the partition λ = (λ1, . . . , λn) define the odd degree as |λ|odd := ∑ i odd λi. Then the degree of Rλ(z) is |λ|odd. • Consider the vector % := ((n−1)r, (n−2)r, . . . , r, 0). Then Rλ(z) vanishes at all points of the form z = %+ μ where μ is any partition with μ 6= λ and |μ|odd ≤ |λ|odd. The simplest nontrivial example comes from the partition (1) = (1, 0, . . . , 0) in which case Rλ(z; r) = ∑n i=1(−1)zi − bn/4c. It is clearly semisymmetric, has degree |λ|odd = 1 and vanishes at z = %+ μ where μ = (0) or μ = (1). The polynomials Rλ(z) are analogous to the polynomials Pλ(z; r) which were previously introduced in[KS1]. In fact, the definition of Pλ is the same except that Pλ is symmetric in all variables z1, . . . , zn and the odd degree |λ|odd is replaced by the (full) degree |λ| = ∑ i λi. The Pλ are called shifted Jack polynomials since their highest degree components are the Jack polynomials. This is in contrast to their semisymmetric counterparts: even their highest degree components form a genuinely new class of multivariable homogeneous polynomials. All the polynomials mentioned above have a representation theoretic origin. LetG be a connected reductive group acting on a finite dimensional vector space V . We are interested in the case when this action is multiplicity free, i.e., every simple G-module occurs at most
منابع مشابه
Invariant Empirical Bayes Confidence Interval for Mean Vector of Normal Distribution and its Generalization for Exponential Family
Based on a given Bayesian model of multivariate normal with known variance matrix we will find an empirical Bayes confidence interval for the mean vector components which have normal distribution. We will find this empirical Bayes confidence interval as a conditional form on ancillary statistic. In both cases (i.e. conditional and unconditional empirical Bayes confidence interval), the empiri...
متن کاملPerturbation, Extraction and Refinement of Invariant Pairs for Matrix Polynomials
Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of linear eigenvalue problems, leading to conceptually elegant and numerically stable formulations in applications that require the computation of several eigenvalues and/or eigenvectors. Similar benefits can be expected for polynomial eigenvalue problems, for which the concept of an invariant subs...
متن کاملON THE USE OF KULSHAMMER TYPE INVARIANTS IN REPRESENTATION THEORY
Since 2005 a new powerful invariant of an algebra has emerged using the earlier work of Horvath, Hethelyi, Kulshammer and Murray. The authors studied Morita invariance of a sequence of ideals of the center of a nite dimensional algebra over a eld of nite characteristic. It was shown that the sequence of ideals is actually a derived invariant, and most recently a slightly modied version o...
متن کاملPerturbation, Computation and Refinement of Invariant Subspaces for Matrix Polynomials
Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of linear eigenvalue problems, leading to conceptually elegant and numerically stable formulations in applications that require the computation of several eigenvalues and/or eigenvectors. Similar benefits can be expected for polynomial eigenvalue problems, for which the concept of invariant subspac...
متن کاملSOLUTION-SET INVARIANT MATRICES AND VECTORS IN FUZZY RELATION INEQUALITIES BASED ON MAX-AGGREGATION FUNCTION COMPOSITION
Fuzzy relation inequalities based on max-F composition are discussed, where F is a binary aggregation on [0,1]. For a fixed fuzzy relation inequalities system $ A circ^{F}textbf{x}leqtextbf{b}$, we characterize all matrices $ A^{'} $ For which the solution set of the system $ A^{' } circ^{F}textbf{x}leqtextbf{b}$ is the same as the original solution set. Similarly, for a fixed matrix $ A $, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999